Cobweb Posets and KoDAG Digraphs are Representing Natural Join of Relations, their diBigraphs and the Corresponding Adjacency
نویسنده
چکیده
sponding adjacency matrices is defined and then applied to investigate the so called cobweb posets and their Hasse digraphs called KoDAGs. KoDAGs are special orderable Directed Acyclic Graphs which are cover relation digraphs of cobweb posets introduced by the author few years ago. KoDAGs appear to be distinguished family of Ferrers digraphs which are natural join of a corresponding ordering chain of one direction directed cliques called di-bicliques. These digraphs serve to represent faithfully corresponding relations of arbitrary arity so that all relations of arbitrary arity are their subrelations. Being this chain − way complete (compare with Kompletne , Kuratowski Kn,m bipartite graphs) their DAG denotation is accompanied with the letter K in front of descriptive abbreviation oDAG. The way to join bipartite digraphs
منابع مشابه
Cobweb Posets and KoDAG Digraphs are Representing Natural Join of Relations, their di-Bigraphs
sponding adjacency matrices is defined and then applied to investigate the so called cobweb posets and their Hasse digraphs called KoDAGs. KoDAGs are special orderable Directed Acyclic Graphs which are cover relation digraphs of cobweb posets introduced by the author few years ago. KoDAGs appear to be distinguished family of Ferrers digraphs which are natural join of a corresponding ordering ch...
متن کاملSome Cobweb Posets Digraphs’ Elementary Properties and Questions
A digraph that represents reasonably a scheduling problem should have no cycles i.e. it should be DAG i.e. a directed acyclic graph. Here down we shall deal with special kind of graded DAGs named KoDAGs. For their definition and first primary properties see [1], where natural join of di-bigraphs (directed bi-parted graphs) and their corresponding adjacency matrices is defined and then applied t...
متن کاملOn natural join of posets properties and first applications.
In early beginnings of the past century Felix Hausdorff introduced the concept of a partially ordered set thus extending Richard Dedekind lattice theory which began in the early 1890s. Then the subject lay more or less dormant until Garrett Birkhoff, Oystein Ore and others picked it up in the 1930s. Since then, many noted mathematicians have contributed to the subject, including Garrett Birkhof...
متن کاملGraded Posets Zeta Matrix Formula
the finite set of minimal elements is delivered following [1]. This is being achieved via adjacency and zeta matrix description of bipartite digraphs chains the representatives of graded posets. The bipartite digraphs elements of such chains amalgamate to form corresponding cover relation graded poset digraphs with corresponding adjacency matrices being amalgamated throughout natural join as sp...
متن کاملCobweb posets - Recent Results
SUMMARY Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers ([6,7] and references therein to the first author).[7,6,8] include natural enquires to be reported on here. The purpose of this pres...
متن کامل